TABU search methodology in global optimization
نویسندگان
چکیده
منابع مشابه
Tabu Search applied to global optimization
A new algorithm called Enhanced Continuous Tabu Search (ECTS) is proposed for the global optimization of multiminima functions. It results from an adaptation of combinatorial Tabu Search which aims to follow, as close as possible, Glover's basic approach. In order to cover a wide domain of possible solutions, our algorithm ®rst performs the diversi®cation: it locates the most promising areas, b...
متن کاملGlobal optimization for artificial neural networks: A tabu search application
The ability of neural networks to closely approximate unknown functions to any degree of desired accuracy has generated considerable demand for Neural Network research in Business. The attractiveness of neural network research stems from researchers’ need to approximate models within the business environment without having a priori knowledge about the true underlying function. Gradient techniqu...
متن کاملHybrid scatter tabu search for unconstrained global optimization
The problem of finding a global optimum of an unconstrained multimodal function has been the subject of intensive study in recent years, giving rise to valuable advances in solution methods. We examine this problem within the framework of adaptive memory programming (AMP), focusing particularly on AMP strategies that derive from an integration of Scatter Search and Tabu Search. Computational co...
متن کاملStructural Optimization with Tabu Search
A class of search techniques for discrete optimization problems, Heuristic Search Methods, and their suitability for structural optimization are studied. The Tabu Search method is selected for application to structural weight optimization of skeleton structures. The search method is first tested to find the minima of a function in a non-linear non-convex optimization mathematical problem, and a...
متن کاملTabu Search Based Circuit Optimization
In this paper we address the problem of optimizing mixed CMOS/BiCMOS circuits. The problem is formulated as a constrained combinatorial optimization problem and solved using an tabu search algorithm. Only gates on the critical sensitizable paths are considered for optimization. Such a strategy leads to sizable circuit speed improvement with minimum increase in the overall circuit capacitance. C...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1999
ISSN: 0898-1221
DOI: 10.1016/s0898-1221(99)00064-4